A class of valid inequalities for multilinear 0-1 optimization problems
نویسندگان
چکیده
This paper investigates the polytope associated with the classical standard linearization technique for the unconstrained optimization of multilinear polynomials in 0-1 variables. A new class of valid inequalities, called 2-links, is introduced to strengthen the LP relaxation of the standard linearization. The addition of the 2-links to the standard linearization inequalities provides a complete description of the convex hull of integer solutions for the case of functions consisting of at most two nonlinear monomials. For the general case, various computational experiments show that the 2links improve both the standard linearization bound and the computational performance of exact branch & cut methods. The improvements are especially significant for a class of instances inspired from the image restoration problem in computer vision. The magnitude of this effect is rather surprising in that the 2-links are in relatively small number (quadratic in the number of terms of the objective function). Keywords— multilinear binary optimization, pseudo-Boolean optimization, integer nonlinear programming, standard linearization [email protected] [email protected]
منابع مشابه
Valid Inequalities and Convex Hulls for Multilinear Functions
We study the convex hull of the bounded, nonconvex setMn = {(x1, . . . , xn, xn+1) ∈ R n+1 : xn+1 = ∏n i=1 xi; i ≤ xi ≤ ui, i = 1, . . . , n + 1} for any n ≥ 2. We seek to derive strong valid linear inequalities forMn; this is motivated by the fact that many exact solvers for nonconvex problems use polyhedral relaxations so as to compute a lower bound via linear programming solvers. We present ...
متن کاملSubset Algebra Lift Operators for 0-1 Integer Programming
We extend the Sherali-Adams, Lovász-Schrijver, Balas-Ceria-Cornuéjols and Lasserre lift-and-project methods for 0-1 optimization by considering liftings to subset algebras. Our methods yield polynomialtime algorithms for solving a relaxation of a set-covering problem at least as strong as that given by the set of all valid inequalities with small coefficients, and, more generally, all valid ine...
متن کاملA polyhedral study of multilinear programs with box constraints
We study the polyhedral convex hull of a mixed-integer set S defined by a collection of multilinear equations of the form yI = ∏ i∈I xi over the 0−1-cube. Such sets appear frequently in the factorable reformulation of mixed-integer nonlinear optimization problems. In particular, the set S represents the feasible region of a linearized unconstrained zeroone polynomial optimization problem. We de...
متن کاملValid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into stochastic optimization problems as constraints. In the discrete case, stochastic optimization models involving second order stochastic dominance (SSD) constraints can be solved by linear programming (LP). However, pr...
متن کاملA Polyhedral Study of the Cardinality Constrained Knapsack Problem
A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas as finance, location, and scheduling. Traditionally, cardinality constraints are modeled by introducing auxiliary 0-1 variables and additional constraints that relate the continuous ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 25 شماره
صفحات -
تاریخ انتشار 2017